Convex vNM-stable sets for linear production games

Convex vNM-stable sets for linear production games

A characterization of vNM-stable sets for linear production games

We discuss linear production games or market games with a continuum of players which are represented as minima of nitely many nonatomic measures. Within this contex we consider vNM-Stable Sets according to von Neumann and Morgenstern. We classify or characterize all solutions of this type which are convex polyhedra, i.e., which are the convex hull of nitely many imputations. Speci cally, in eac...

C-complete sets for compromise stable games

The core cover of a TU-game is a superset of the core and equals the convex hull of its larginal vectors. A larginal vector corresponds to an ordering of the players and describes the efficient payoff vector giving the first players in the ordering their utopia demand as long as it is still possible to assign the remaining players at least their minimum right. A game is called compromise stable...

Leadership games with convex strategy sets

A basic model of commitment is to convert a two-player game in strategic form to a “leadership game” with the same payoffs, where one player, the leader, commits to a strategy, to which the second player always chooses a best reply. This paper studies such leadership games for games with convex strategy sets. We apply them to mixed extensions of finite games, which we analyze completely, includ...

On Bargaining Sets of Convex NTU Games

We show that the Aumann-Davis-Maschler bargaining set and the Mas-Colell bargaining set of a non-leveled NTU game that is either ordinal convex or coalition merge convex coincides with the core of the game. Moreover, we show by means of an example that the foregoing statement may not be valid if the NTU game is marginal convex.